A probabilistic strategy for temporal constraint management in scientific workflow systems
نویسندگان
چکیده
In scientific workflow systems, it is critical to ensure the timely completion of scientific workflows. Therefore, temporal constraints, as a type of QoS (Quality of Service) specification, are usually required to be managed in scientific workflow systems. Specifically, temporal constraint management includes two basic tasks: setting temporal constrains at workflow build time and updating temporal constraints at workflow run time. For constraint setting, the current work mainly adopts user specified temporal constraints without considering system performance. Hence, it may result in frequent temporal violations which deteriorate the overall workflow execution effectiveness. As for constraint updating which so far has not been well investigated, it is in fact of great importance to workflow management tasks such as workflow scheduling and exception handling. In this paper, with a systematic analysis of the above issues, we propose a probabilistic strategy for temporal constraint management which utilises a novel probability based temporal consistency model. Specifically, for constraint setting, a negotiation process between the client and the service provider is designed to support the setting of coarse-grained temporal constraints and then automatically derive the fine-grained temporal constraints; for constraint updating, the probability time deficit/redundancy propagation process is proposed to update run-time finegrained temporal constraints when workflow execution is either ahead of or behind the schedule. The effectiveness of our strategy is demonstrated through a case study on an example scientific workflow process in our scientific workflow system.
منابع مشابه
A Probabilistic Strategy for Setting Temporal Constraints in Scientific Workflows
In scientific workflow systems, temporal consistency is critical to ensure the timely completion of workflow instances. To monitor and guarantee the correctness of temporal consistency, temporal constraints are often set and then verified. However, most current work adopts user specified temporal constraints without considering system performance, and hence may result in frequent temporal viola...
متن کاملSelecting Necessary and Sufficient Checkpoints for Dynamic Verification of Fixed-Time Constraints in Grid Workflow Systems
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...
متن کاملNecessary and Sufficient Checkpoint Selection in Grid Workflow Systems
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...
متن کاملSpecial Issue: Fourth International Workshop on Workflow Management (ICWM2009)
This special issue of Concurrency and Computation: Practice and Experience contains selected high-quality papers from the Fourth International Workshop on Workflow Management (ICWM2009), which was held on May 4, 2009, in Geneva, Switzerland [1]. The ICWM workshop series aims to provide an international forum for the presentation and discussion of research and development trends regarding workfl...
متن کاملDuration Histograms for Workflow Systems
Web-based interorganizational workflows need efficient time management. Variations of activity durations and branching distributions on or-split nodes make it necessary that we treat time management in workflows in a probabilistic way. We introduce the notion of duration histograms for capturing the available temporal information about workflow execution, define the necessary operations for com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 23 شماره
صفحات -
تاریخ انتشار 2011